2-Testability and Relabelings Produce Everything
نویسندگان
چکیده
منابع مشابه
2-Testability and Relabelings Produce Everything
We show that grammar systems with communication by command and with extremely simple rewriting rules (in fact, only relabelings are needed) are able to generate all recursively enumerable languages. The result settles several open problems in the area of grammar systems. We also present the result in a general framework, without referring to grammar systems, obtaining a characterization of recu...
متن کاملEnumeration on Trees under Relabelings
We study how to evaluate MSO queries with free variables on trees, within the framework of enumeration algorithms. Previous work has shown how to enumerate answers with linear-time preprocessing and delay linear in the size of each output, i.e., constant-delay for free first-order variables. We extend this result to support relabelings, a restricted kind of update operations on trees which allo...
متن کاملStructural Information in Graphs: Symmetries and Admissible Relabelings∗
We study structural properties of preferential attachment graphs (with parameter m ≥ 1 giving the number of attachment choices that each new vertex makes) which intervene in two complementary algorithmic/statistical/information-theoretic problems involving the information shared between a random graph’s labels and its structure: in structural compression, we seek to compactly describe a graph’s...
متن کاملTestability Transformation - Program Transformation to Improve Testability
Testability transformation is a new form of program transformation in which the goal is not to preserve the standard semantics of the program, but to preserve test sets that are adequate with respect to some chosen test adequacy criterion. The goal is to improve the testing process by transforming a program to one that is more amenable to testing while remaining within the same equivalence clas...
متن کاملTestability, Likelihoods, and Design
It is often assumed by friends and foes alike of intelligent design that a likelihood approach to design inferences will require evidence regarding the specific motives and abilities of any hypothetical designer. Elliott Sober, like Venn before him, indicates that this information is unavailable when the designer is not human (or at least finite) and concludes that there is no good argument for...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1998
ISSN: 0022-0000
DOI: 10.1006/jcss.1997.1548